#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;

#define in read()
#define pii pair<int,int>
#define fi first
#define se second
#define FILE(x) freopen(x".in","r",stdin);\
	freopen(x".out","w",stdout);
#define pb push_back

int read(){
	int x = 0,sgn = 1;char ch = getchar();
	for(;!isdigit(ch);ch = getchar()) if(ch == '-') sgn = -1;
	for(;isdigit(ch);ch = getchar()) x = (x<<1)+(x<<3)+(ch^48);
	return x*sgn;
}

const int N = 2010;
const int mod = 1e9+7;

int fac[N],ifac[N],n,m,k;

ll qp(ll x,int t){ll res=1;for(;t;t>>=1,x=x*x%mod) if(t&1) res=res*x%mod;return res;}

void init(int l){
	for(int i = (fac[0] = 1);i <= l;i++) fac[i] = 1ll * fac[i-1] * i % mod; ifac[l] = qp(fac[l],mod-2);
	for(int i = l - 1;i >= 0;i--) ifac[i] = ifac[i + 1] * 1ll * (i + 1) % mod;
}

ll C(int x,int y){if(x < y || x < 0 || y < 0) return 0; return fac[x] * 1ll * ifac[y] % mod * ifac[x - y] % mod;}

int main (){
#ifndef ONLINE_JUDGE
	freopen("1.in","r",stdin);
#endif
	n = in,m = in,k = in;
	init(max(n,m));
	ll ans = C(n - 1,2 * k) * C(m - 1,2 * k) % mod;
	printf("%lld\n",ans);
	return 0;
}

